Typical peak sidelobe level of binary sequences
نویسندگان
چکیده
منابع مشابه
Improved bounds on the peak sidelobe level of binary sequences
Schmidt proved in 2014 that if ε > 0, almost all binary sequences of length n have peak sidelobe level between ( √ 2 − ε)√n log n and ( √ 2 + ε) √ n log n. Because of the small gap between his upper and lower bounds, it is difficult to find improved upper bounds that hold for almost all binary sequences. In this note, we prove that if ε > 0, then almost all binary sequences of length n have pea...
متن کاملThe peak sidelobe level of random binary sequences
Binary sequences with small autocorrelation at nonzero shifts have a wide range of applications in digital communications, including synchronisation and radar. Let Mn be the minimum of M(A) taken over all 2 n binary sequences A of length n. By a parity argument, it is seen that Mn ≥ 1 and it is known that Mn = 1 for n ∈ {2, 3, 4, 5, 7, 11, 13}, which arises from the existence of a Barker sequen...
متن کاملBounds on the growth rate of the peak sidelobe level of binary sequences
The peak sidelobe level (PSL) of a binary sequence is the largest absolute value of all its nontrivial aperiodic autocorrelations. A classical problem of digital sequence design is to determine how slowly the PSL of a length n binary sequence can grow, as n becomes large. Moon and Moser showed in 1968 that the growth rate of the PSL of almost all length n binary sequences lies between order √ n...
متن کاملConstructing Binary Sequences with Optimal Peak Sidelobe Level: An Efficient Analytical-Computational Interplay
Binary sequence sets with asymptotically optimal auto/cross-correlation peak sidelobe level (PSL) growth have been known in the literature for a long time, and their construction has been studied both analytically and numerically. In contrast, it has been a long-standing problem whether we can construct a family of binary sequences whose auto-correlation PSL grows in an optimal manner. In this ...
متن کاملBinary Sequences with Minimum Peak Sidelobe Level up to Length 68
Results of an exhaustive search for minimum peak sidelobe level binary sequences are presented. Several techniques for efficiency implementation of search algorithm are described. A table of number of non-equivalent optimal binary sequences with minimum peak sidelobe (MPS) level up to length 68 is given. This number can be used in prediction of the longest length for a given sidelobe level of b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2009.2034803